Static Type Checking of Model Transformations by Constraint Satisfaction Programming
نویسندگان
چکیده
The control structure of the Viatra2 transformation programs is untyped making it easier to misuse the type system. The aim of this paper is to provide a static type checker tool to these transformation programs that can detect those errors. We use a generic static analysis framework for analysis, and as an underlying engine constraint satisfaction problem solver is used. For this reason it is required to translate the metamodel (that acts as the type system) and the type safety properties of the transformation program to constraints.
منابع مشابه
Static Type Checking of Model Transformation Programs
Model transformation is seen as a promising approach to automate software development and verification, thus improving quality and reducing production costs significantly. However, errors of transformation programs can propagate into the generated artifacts complicating the detection of errors. The current paper proposes a static type checking approach for early detection of typing errors of pa...
متن کاملMulti-item inventory model with probabilistic demand function under permissible delay in payment and fuzzy-stochastic budget constraint: A signomial geometric programming method
This study proposes a new multi-item inventory model with hybrid cost parameters under a fuzzy-stochastic constraint and permissible delay in payment. The price and marketing expenditure dependent stochastic demand and the demand dependent the unit production cost are considered. Shortages are allowed and partially backordered. The main objective of this paper is to determine selling price, mar...
متن کاملBinary vs. non-binary constraints
There are two well known transformations from non-binary constraints to binary constraints applicable to constraint satisfaction problems (CSPs) with finite domains: the dual transformation and the hidden (variable) transformation. We perform a detailed formal comparison of these two transformations. Our comparison focuses on two backtracking algorithms that maintain a local consistency propert...
متن کاملFormalization of QVT-Relations: OCL-based Static Semantics and Alloy-based Validation
The OMG QVT standard aims at consolidating and simplifying the model transformation landscape by offering three domain-specific languages (Relations, Operational Mappings, and Core) inspired in the declarative and imperative paradigms. We focus on QVT-Relations, which allows declaring a transformation as a set of relations that should hold between concrete models. The standard states the wellfo...
متن کاملA Schema for Adding Dependent Types to ML
We present an approach to enriching ML’s type system with a form of dependent types, where index objects are restricted to some constraint domains C, leading to the DML(C) language schema. Pure inference for the resulting system is no longer possible, but we show that typechecking a sufficiently annotated program can be reduced to constraint satisfaction. We exhibit the unobtrusiveness of our a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009